منابع مشابه
Stability for Vertex Cycle Covers
In 1996 Kouider and Lonc proved the following natural generalization of Dirac’s Theorem: for any integer k > 2, if G is an n-vertex graph with minimum degree at least n/k, then there are k − 1 cycles in G that together cover all the vertices. This is tight in the sense that there are n-vertex graphs that have minimum degree n/k − 1 and that do not contain k − 1 cycles with this property. A conc...
متن کاملVertex Covers and Connected Vertex Covers in 3-connected Graphs
A vertex cover of a graph G=(V,E) is a subset N of V such that each element of E is incident upon some element of N, where V and E are the sets of vertices and of edges of G, respectively. A connected vertex cover of a graph G is a vertex cover of G such that the subgraph G[N] induced by N of G is connected. The minimum vertex cover problem (VCP) is the problem of finding a vertex cover of mini...
متن کاملMessage passing for vertex covers
Constructing a minimal vertex cover of a graph can be seen as a prototype for a combinatorial optimization problem under hard constraints. In this paper, we develop and analyze message-passing techniques, namely, warning and survey propagation, which serve as efficient heuristic algorithms for solving these computational hard problems. We show also, how previously obtained results on the typica...
متن کاملVertex covers by edge disjoint
Let H be a simple graph having no isolated vertices. An (H; k)-vertex-cover of a simple graph G = (V;E) is a collection H1; : : : ;Hr of subgraphs of G satisfying 1. Hi = H; for all i = 1; : : : ; r; 2. [i=1V (Hi) = V , 3. E(Hi) \ E(Hj) = ;; for all i 6= j; and 4. each v 2 V is in at most k of the Hi. We consider the existence of such vertex covers when H is a complete graph, Kt; t 3, in the co...
متن کاملIdentifying Vertex Covers in Graphs
An identifying vertex cover in a graph G is a subset T of vertices in G that has a nonempty intersection with every edge of G such that T distinguishes the edges, that is, e∩T 6= ∅ for every edge e in G and e∩T 6= f ∩T for every two distinct edges e and f in G. The identifying vertex cover number τD(G) of G is the minimum size of an identifying vertex cover in G. We observe that τD(G) + ρ(G) = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/5185